Three-manifolds with Heegaard genus at most two represented by crystallisations with at most 42 vertices
نویسندگان
چکیده
منابع مشابه
Three-manifolds with Heegaard genus at most two represented by crystallisations with at most 42 vertices
It is known that every closed compact orientable 3-manifold M can be represented by a 4-edge-coloured 4-valent graph called a crystallisation of M. Casali and Grasselli proved that 3-manifolds of Heegaard genus g can be represented by crystallisations with a very simple structure which can be described by a 2(g +1)-tuple of non-negative integers. The sum of first g +1 integers is called complex...
متن کامل3-manifolds with Heegaard Genus at Most Two
Acknowledgements My foremost thanks are to my supervisor Roman Nedela, for his continual encouragement, support and patience, for many inspirational conversations, leading me in the times of hasitations and careful reading many versions of the draft. Thanks also to Peter Maličk´y for the effort with some computations with groups and many advices in topology. Thanks also to Mathematical Institut...
متن کاملCOSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملChromaticity of Turan Graphs with At Most Three Edges Deleted
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
متن کاملcospectrality measures of graphs with at most six vertices
cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. actually,the origin of this concept came back to richard brualdi's problems that are proposed in cite{braldi}:let $g_n$ and $g'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2 g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.11.017